منابع مشابه
Boolean Formulae, Hypergraphs and Combinatorial Topology
With a view toward studying the homotopy type of spaces of Boolean formulae, we introduce a simplicial complex, called the theta complex, associated to any hypergraph. In particular, the set of satisfiable formulae in k-conjunctive normal form with ≤ n variables has the homotopy type of Θ(Cube(n, n− k)), where Cube(n, n− k) is a hypergraph associated to the (n− k)-skeleton of an n-cube. We make...
متن کاملLocal formulae for combinatorial Pontrjagin classes
By p(|K|) denote the characteristic class of a combinatorial manifold K given by the polynomial p in Pontrjagin classes of K. We prove that for any polynomial p there exists a function taking each combinatorial manifold K to a rational simplicial cycle z(K) such that: (1) the Poincaré dual of z(K) represents the cohomology class p(|K|); (2) a coefficient of each simplex ∆ in the cycle z(K) is d...
متن کاملCombinatorial characterization of read-once formulae
We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose formula size is exactly the number of variables. Those functions are called Read-Once. We use methods of combinatorial optimization and give as a corollary an alternative proof for some results of Seymour.
متن کاملMultiple Combinatorial Stokes’ Theorem with Balanced Structure
Combinatorics of complexes plays an important role in topology, nonlinear analysis, game theory, and mathematical economics. In 1967, Ky Fan used door-to-door principle to prove a combinatorial Stokes’ theorem on pseudomanifolds. In 1993, Shih and Lee developed the geometric context of general position maps, π-balanced and π-subbalanced sets and used them to prove a combinatorial formula for mu...
متن کاملCombinatorial Stokes formulas via minimal resolutions
We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Zk of order k. We then demonstrate how such a chain map induces a “Zk-combinatorial Stokes theorem”, which in turn implies “Dold’s theorem” that there is no equivariant map from an n-connected to an n-dimensional free Zk-complex. Thus we build a combinatorial access road to probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2008
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2006.07.010